The Functional Imperative: Shape!
نویسندگان
چکیده
منابع مشابه
Partial Evaluation of Shaped Programs: Experience with FISh
FISh is an array-based programming language that combines imperative and functional programming styles. Static shape analysis uses partial evaluation to convert arbitrary programs into simple, eecient imperative programs. This paper explains how to compute shapes statically, and uses concrete examples to illustrate its several eeects on performance.
متن کاملAlias Types
Linear type systems allow destructive operations such as object deallocation and imperative updates of functional data structures. These operations and others, such as the ability to reuse memory at different types, are essential in low-level typed languages. However, traditional linear type systems are too restrictive for use in low-level code where it is necessary to exploit pointer aliasing....
متن کاملA Functional View of Imperative Information Flow
We analyze dynamic information-flow control for imperative languages in terms of functional computation. Specifically, we translate an imperative language to a functional language, thus accounting for the main difficulties of information-flow control in the imperative language.
متن کاملAbsorption of DCM Dye in Ethanol: Experimental and Time Dependent Density Functional Study
Experimental and theoretical absorption spectra of [2-[2-[4-(dimethylamino) phenyl]ethenyl]-6-methyl-4H- pyran-4-ylidene]-propanedinitrile (DCM) have been studied. UV-Visible (UV-Vis.) absorption spectrum of DCM has been reported after its synthesis. Two relatively intense peaks appeared at 473 and 362 nm respectively. A theoretical investigation on the electronic structure of DCM is presented ...
متن کاملShape Analysis for Unstructured Sharing
Shape analysis aims to infer precise structural properties of imperative memory states and has been applied heavily to verify safety properties on imperative code over pointer-based data structures. Recent advances in shape analysis based on separation logic has leveraged summarization predicates that describe unbounded heap regions like lists or trees using inductive definitions. Unfortunately...
متن کامل